Computability logic - PDFSEARCH.IO - Document Search Engine

Computability logic
Results: 552

#	Item
461	INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introduction Degree theory studies mathematical structures, which arise from a formal notion of reducib Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2011-05-26 05:13:53 Logic Theory of computation Turing degree Enumeration Constructible universe Forcing Mathematical logic Mathematics Computability theory
462	KALIMULLIN PAIRS OF Σ02 ω-ENUMERATION DEGREES IVAN N. SOSKOV AND MARIYA I. SOSKOVA Abstract. We study the notion of K-pairs in the local structure of the ωenumeration degrees. We introduce the notion of super almost z Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2011-05-26 05:11:20 Enumeration Logic Ordinal number Turing degree Philosophy of mathematics Constructible universe Mathematics Computability theory Mathematical logic
463	DEFINING TOTALITY IN THE ENUMERATION DEGREES MINGZHONG CAI, HRISTO A. GANCHEV, STEFFEN LEMPP, JOSEPH S. MILLER, AND MARIYA I. SOSKOVA Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-compu Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2014-01-28 17:21:47 Mathematical logic Field extension Rational number Computability theory Primitive recursive function Mathematics Field theory Enumeration
464	The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 RANDOMNESS, LOWNESS AND DEGREES GEORGE BARMPALIAS, ANDREW E. M. LEWIS, AND MARIYA SOSKOVA Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2010-09-03 11:30:51 Computability Applied mathematics Mathematics Computer science Computability theory Algorithmically random sequence Turing reduction
465	Sino-Germany Project July, 2005 Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Mathematical logic Computable number Computable analysis Computable real function Low Turing machine Computable measure theory Computability Computable function Computability theory Theoretical computer science Theory of computation
466	Cupping Computably Enumerable Degrees in the Difference Hierarchy Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Applied mathematics Turing degree Recursively enumerable set Computable function Creative and productive sets Function Mathematical logic Computability theory Theory of computation Mathematics
467	Locally countable orderings Liang Yu Department of mathematics Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:21 Structure Antichain Turing degree Partially ordered set Computability theory Forcing Countable chain condition Order theory Mathematics Mathematical logic
468	Background Hyperarithmetic analysis New statements Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Proof theory Computability theory Reverse mathematics Second-order arithmetic Ordinal number Constructible universe Axiom Mathematical logic Logic Mathematics
469	History Logic and Medvedev Degrees Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:21 Computer science Turing degree Representation theory Reduction Computability theory Theoretical computer science Mathematics
470	Logical Methods in Computer Science Vol. 5 (3:[removed], pp. 1–52 www.lmcs-online.org Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-12-22 08:41:55 Mathematical logic Computability theory Simply typed lambda calculus Combinatory logic Unification Free variables and bound variables Variable Mathematics Theoretical computer science Lambda calculus

UPDATE